Function values are enough for L2-approximation: Part II

In the first part we have shown that, for L2-approximation of functions from a separable Hilbert space in worst-case setting, linear algorithms based on function values are almost as powerful arbitrary if widths square-summable. That is, they achieve same polynomial rate convergence. this sequel, prove similar result Banach spaces and other classes functions.